Approaches to reduce the computational cost when solving linear systems of equations arising in Boundary Element Method discretizations

نویسندگان

  • Erik Bängtsson
  • Maya Neytcheva
چکیده

Preconditioned iterative solution methods are compared with the direct Gaussian elimination method to solve dense linear systems Ax = b which originate from crack propagation problems, modeled and discretized by boundary element (BEM) techniques. Numerical experiments are presented and compared with the direct solution method available in a commercial BEM package. The experiments show that the preconditioned iterative schemes are competitive compared to the direct solver with respect to both arithmetic operations required and memory demands.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving large systems arising from fractional models by preconditioned methods

This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...

متن کامل

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

A new multi-step ABS model to solve full row rank linear systems

ABS methods are direct iterative methods for solving linear systems of equations, where the i-th iteration satisfies the first i equations. Thus, a system of m equations is solved in at most m ABS iterates. In 2004 and 2007, two-step ABS methods were introduced in at most [((m+1))/2] steps to solve full row rank linear systems of equations. These methods consuming less space, are more compress ...

متن کامل

A Local Strong form Meshless Method for Solving 2D time-Dependent Schrödinger Equations

This paper deals with the numerical solutions of the 2D time dependent Schr¨odinger equations by using a local strong form meshless method. The time variable is discretized by a finite difference scheme. Then, in the resultant elliptic type PDEs, special variable is discretized with a local radial basis function (RBF) methods for which the PDE operator is also imposed in the local matrices. Des...

متن کامل

CAS WAVELET METHOD FOR THE NUMERICAL SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH LOGARITHMIC SINGULAR KERNELS

In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003